翻訳と辞書 |
Conflict-Driven Clause Learning : ウィキペディア英語版 | Conflict-Driven Clause Learning In computer science, Conflict-Driven Clause Learning (CDCL) is an algorithm for solving the Boolean satisfiability problem (SAT). Given a Boolean formula, the SAT problem asks for an assignment of variables so that the entire formula evaluates to true. The internal workings of CDCL SAT solvers were inspired by DPLL solvers. Conflict-Driven Clause Learning was proposed by Marques-Silva and Sakallah (1996, 1999 ) and Bayardo and Schrag (1997 ) ==Background== Background knowledge about the following issues is needed to have a clear idea about the CDCL algorithm.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Conflict-Driven Clause Learning」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|